Cost of Scaling

Dish Cost Frequency Scaling

The Scaling of Search Cost

We show that a resealed constrainedness parameter provides the basis for accurate numerical models of search cost for both backtracking and local search algorithms. In the past, the scaling of performance has been restricted to critically constrained problems at the phase transition. Here, we show how to extend models of search cost to the full width of the phase transition. This enables the di...

Collider Scaling and Cost Estimation

Finding minimum-cost flows by double scaling

Several researchers have recently developed new techniques that give fast algorithms for the minimum-cost flow problem. In this paper we combine : . several of these techniques to yield an algorithm running in O(nm log log U log(nC)) time on networks with n vertices, m edges, maximum arc capacity U, and maximum am cost magnitude C. The major techniques used . are the capacity-scaling approach o...

Finding Minimuni-cost Flows by Double Scaling

Several researchers have recently developed new techniques that give fast algorithms for the minimum-cost flow problem. In this paper we combine several of these techniques to yield an algorithm running in O(nm log log U log(nC)) time on networks with n vertices, m arcs, maximum arc capacity U, and maximum arc cost magnitude C. The major techniques used are the capacity-scaling approach of Edmo...